Extending Precolorings to Distinguish Group Actions

Given a group Γ acting on a set X, a k-coloring φ : X → {1, . . . , k} of X is distinguishing with respect to Γ if the only γ ∈ Γ that fixes φ is the identity action. The distinguishing number of the action Γ, denoted DΓ(X), is then the smallest positive integer k such that there is a distinguishing k-coloring of X with respect to Γ. This notion has been studied in a number of settings, but by far the largest body of work has been concerned with finding the distinguishing number of the action of the automorphism group of a graph G upon its vertex set, which is referred to as the distinguishing number of G. The distinguishing number of a group action is a measure of how difficult it is to “break” all of the permutations arising from that action. In this paper, we aim to further differentiate the resilience of group actions with the same distinguishing number. In particular, we introduce a precoloring extension framework to address this issue. A set S ⊆ X is a fixing set for Γ if for every non-identity element γ ∈ Γ there is an element s ∈ S such that γ(s) 6= s. The distinguishing extension number extD(X,Γ; k) is the minimum number m such that for all fixing sets W ⊆ X with |W | ≥ m, every k-coloring c : X \W → [k] can be extended to a k-coloring that distinguishes X. In this paper, we prove that extD(R,Aut(R), 2) = 4, where Aut(R) is comprised of compositions of translations and reflections. We also consider the distinguishing extension number of the circle and (finite) cycles, obtaining several exact results and bounds.